Two-Stage Bargaining Solutions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-stage Bargaining Solutions

We introduce and characterize a new class of bargaining solutions: those which can be obtained by sequentially applying two binary relations to eliminate alternatives. As a by-product we obtain as a particular case a partial characterization result by Zhou (Econometrica, 1997) of an extension of the Nash axioms and solution to domains including non-convex problems, as well as a complete charact...

متن کامل

A Tale of Two Bargaining Solutions

We set up a rich bilateral bargaining model with four salient points (disagreement point, ideal point, reference point, and tempered aspirations point), where the disagreement point and the utility possibilities frontier are endogenously determined. This model allows us to compare two bargaining solutions that use reference points, the Gupta-Livne solution and the tempered aspirations solution,...

متن کامل

Uncovered bargaining solutions

An uncovered bargaining solution is a bargaining solution for which there exists a complete and strict relation (tournament) such that, for each feasible set, the bargaining solution set coincides with the uncovered set of the tournament. We provide a characterization of a class of uncovered bargaining solutions. J.E.L. codes: C72, D44.

متن کامل

Ordinal Solutions to Bargaining Problems

A solution to bargaining problems is ordinal when it is covariant with order-preserving transformations of utility. Shapley (1969) has shown that there exists no ordinal, efficient, and symmetric solution to twoplayer bargaining problems, and has constructed such a solution to threeplayer problems. Here, Shapley’s solution is extended in two directions. First, it is shown how to construct an in...

متن کامل

The Properly Efficient Bargaining Solutions

This note is motivated by the similarity between multiobjective programming (MOP) and bargaining theory. It uses the known MOP concepts to establish two new bargaining results: (1) the efficiency of KalaiSmorodinsky (KS) and Nash (NA) solutions for large classes of bargaining problems can be refined to the sharper concept of proper efficiency; (2) the independence of irrelevant alternatives (II...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2008

ISSN: 1556-5068

DOI: 10.2139/ssrn.924738